Using Fixed Priority Scheduling with Deferred Preemption to Exploit Fluctuating Network Bandwidth
نویسندگان
چکیده
Fixed Priority Scheduling with Deferred Preemption (FPDS) offers a balance between Fixed Priority Non-preemptive Scheduling (FPNS) and Fixed Priority Preemptive Scheduling (FPPS), by allowing preemptions only at specified preemption points. It provides finer grained preemptions than FPNS, improving the schedulability of higher priority tasks, and a coarser grain preemptions than FPPS, reducing switching overhead incurred during arbitrary preemptions. In this paper we investigate the extent of improvement of FPDS with respect to FPPS and qualify the costs of switching multiple resources under FPPS and FPDS, and the cost of a preemption point. It forms a starting point for our research into employing FPDS in an industrial case study, to improve an existing multimedia processing system from the surveillance domain. We focus on extending FPDS with optional preemption points, to guarantee resource provisions to tasks in spite of fluctuating resource availability, in the context of reservation-based multi-resource sharing.
منابع مشابه
Extending RTAI/Linux with Fixed-Priority Scheduling with Deferred Preemption
Fixed-Priority Scheduling with Deferred Preemption (FPDS) is a middle ground between Fixed-Priority Preemptive Scheduling and Fixed-Priority Non-preemptive Scheduling, and offers advantages with respect to context switch overhead and resource access control. In this paper we present our work on extending the realtime operating system RTAI/Linux with support for FPDS. We give an overview of poss...
متن کاملExact worst-case response times of real-time tasks under fixed-priority scheduling with deferred preemption
In this paper, we present equations to determine the exact worst-case response times of periodic tasks under fixedpriority scheduling with deferred preemption (FPDS) and arbitrary phasing. We show that the worst-case response time analysis is not uniform for all tasks. Our exact analysis is based on a dedicated conjecture for an ε-critical instant, and uses the notion of worst-case occupied time.
متن کاملExisting worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption is too optimistic
This paper revisits response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [5, 6, 7], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that task when r...
متن کاملExisting worst-case response time analysis of real-time tasks under fixed-priority scheduling with deferred preemption refuted
This paper revisits worst-case response time analysis of real-time tasks under fixed priority scheduling with deferred preemption (FPDS), arbitrary phasing, and deadlines within periods. We show that existing worst-case response time analysis, as presented in [3, 4, 5], is too optimistic. In particular, the worst-case response time of a task is not necessarily assumed for the first job of that ...
متن کاملOSPERT 2009 : International Workshop on Operating Systems
Fixed-Priority Scheduling with Deferred Preemption (FPDS) is a middle ground between Fixed-Priority Preemptive Scheduling and Fixed-Priority Non-preemptive Scheduling, and offers advantages with respect to context switch overhead and resource access control. In this paper we present our work on extending the realtime operating system RTAI/Linux with support for FPDS. We give an overview of poss...
متن کامل